|
Clustering for point objects based on spatial proximity
YU Li, GAN Shu, YUAN Xiping, LI Jiatian
Journal of Computer Applications
2016, 36 (5):
1267-1272.
DOI: 10.11772/j.issn.1001-9081.2016.05.1267
Spatial clustering is one of the vital research directions in spatial data mining and knowledge discovery. However, constrained by the complex distribution of uneven density, various shapes and multi-bridge connection of points, most clustering algorithms based on distance or density cannot identify high aggregative point sets efficiently and effectively. A point clustering method based on spatial proximity was proposed. According to the structure of point Voronoi diagram, adjacent relationships among points were recognized. The similarity criteria was defined by region of Voronoi, a tree structure was built to recognize point-target clusters. The comparison experiments were conducted on the proposed algorithm,
K-means algorithm and Density-Based Spatial Clustering of Applications with Noise (DBSCAN) algorithm. Results show that the proposed algorithm is capable for identifying clusters in arbitrary shapes, with different densities and connected only at bridges or chains, meanwhile also suitable for aggregative pattern recognition in heterogeneous space.
Reference |
Related Articles |
Metrics
|
|